Triangular Mesh Deformation via Edge-Based Graph
نویسندگان
چکیده
منابع مشابه
Network Sampling via Edge-based Node Selection with Graph Induction
In order to efficiently study the characteristics of network domains and support development of network systems (e.g. algorithms, protocols that operate on networks), it is often necessary to sample a representative subgraph from a large complex network. While prior research has shown that topological (e.g. random-walk based) sampling methods produce more accurate samples than approaches based ...
متن کاملMesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be used to reformulate longest-edge algorithms to develop new algorithms and to design efficient data structures for the refinement/derefinement of 2D and 3D triangulations.
متن کاملPseudo-Skeleton based ARAP Mesh Deformation
In this work, we present a handle-based direct manipulation paradigm that builds upon a pseudo-skeleton with bones that are allowed to stretch and twist. Solving for the unknown positions of the joints in an as-rigidas-possible manner decouples the optimization problem from the geometric complexity of the input model allowing for real-time edits even for high-quality datasets. The degrees of fr...
متن کاملParallel Triangular Mesh Reduction
The visualization of large and complex models is required frequently. This is followed by number of operations which must be done before visualization itself, whether it is an analysis of input data or a model simplification. One of the techniques that enhance the computational power is parallel computation. It can be seen that multiprocessor computers are more often available even for ordinary...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design and Applications
سال: 2012
ISSN: 1686-4360
DOI: 10.3722/cadaps.2012.345-359